Locally-finite connected-homogeneous digraphs
نویسندگان
چکیده
منابع مشابه
The classification of finite and locally finite connected-homogeneous digraphs
We classify the finite connected-homogeneous digraphs, as well as the infinite locally finite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
متن کاملDescendant-homogeneous digraphs
The descendant set desc(α) of a vertex α in a digraph D is the set of vertices which can be reached by a directed path from α. A subdigraph of D is finitely generated if it is the union of finitely many descendant sets and D is descendant-homogeneous if it is vertex transitive and any isomorphism between finitely generated subdigraphs extends to an automorphism. We consider connected descendant...
متن کاملHighly arc transitive digraphs: reachability, topological groups
Let D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachability relation is not universal in D provided that the stabilizer of an edge satisfies certain conditions which seem to be typical for highly arc transitive digraphs. As an implication, the reachability relation cannot be universal in highly arc transitive digraphs with prime inor out-degree. Two differe...
متن کاملThe Classification of Connected-homogeneous Digraphs with More than One End
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
متن کاملOn locally finite transitive two - ended digraphs *
Since decades transitive graphs are a topic of great interest. The study of s-edge transitive (undirected) graphs goes back to Tutte [13], who showed that finite cubic graphs cannot be s-edge transitive for s> 5. Weiss [14] proved several years later that the only finite connected s-edge transitive graphs with s = 8 are the cycles. Considering directed graphs the situation is much more involved...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011